package algorithm.kmp;

/**
 * @ author : HyoJoo-W
 * @ createDate : 2021-06-06 17:34
 * @ Description :
 */
public class ViolenceMatch
{
    public static void main(String[] args)
    {
        String str1 = "硅硅谷 尚硅谷你尚硅 尚硅谷你尚硅谷你尚硅你好";
        String str2 = "尚硅谷你尚硅你";
        int index = violenceMatch(str1,str2);
        System.out.println("index = " + index);
    }

    public static int violenceMatch(String str1,String str2)
    {
        char[] s1 = str1.toCharArray();
        char[] s2 = str2.toCharArray();

        int s1Len = s1.length;
        int s2Len = s2.length;

        int i = 0;
        int j = 0;

        while (i < s1Len && j <s2Len)
        {
            if (s1[i] == s2[j])
            {
                i++;
                j++;
            }
            else
            {
                i = i - (j - 1);//相当于i++
                j = 0;
            }
        }

        if (j == s2Len)
        {
            return i - j;
        }
        else
        {
            return -1;
        }

    }

}
